Hybridizing Integer Programming Models with an Adaptive Decomposition Approach for Exam Timetabling Problems
نویسندگان
چکیده
The idea of decomposition has been successfully applied to address large combinatorial optimization problems across a range of applications. However, in timetabling, it has not been widely applied. One major difficulty of course, is that early assignment in one sub-problem may lead to later conflict in solving interrelated sub-problems. In our previous work, timetabling problems were adaptively decomposed into a difficult set and an easy set of exams. They were generated by using the information gathered from previous iterations during the problem solving. The approach obtained promising results and showed somewhat unsurprisingly, that a small set of difficult exams contributed to a much larger portion of the total cost of the solution constructed. An interesting issue, which is explored in this paper, is to investigate the effect of constructing complete solutions based on an optimal solution of this difficult sub-problem. In this paper, we first present an IP formulation for solving the difficult sub-problem. To have a tighter initial formulation, a well-known inequality called the Clique Inequality is utilized. We then examine the combinatorial properties of the problem to introduce a new family of cutting planes. These are shown to be helpful in obtaining a solution which is within a gap of less than 10% of optimal for the sub-problem, based on which the final solution is constructed. Promising results have been obtained on several benchmark exam timetabling problems in the literature.
منابع مشابه
RESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملبرنامهریزی درسی در دانشگاه به کمک مدل‌سازی دو مرحله‌ای برنامه‌ریزی ریاضی
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
متن کاملAdaptive Decomposition and Construction for Examination Timetabling Problems
Decomposition techniques have not been widely investigated in timetabling research mainly due to the complexity of the problems. In this paper, we develop a new general adaptive decomposition technique where problems are iteratively partitioned into two sub-sets, each containing a set of events with different levels of difficulty. The events in these two sets, namely the difficult set and the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009